Sports tournaments, home–away assignments, and the break minimization problem
نویسندگان
چکیده
منابع مشابه
Sports tournaments, home-away assignments, and the break minimization problem
We consider the break minimization problem for fixing home-away assignments in round-robin sports tournaments. First, we show that for an opponent schedule with n teams and n− 1 rounds, there always exists a home-away assignment with at most 1 4n(n−2) breaks. Secondly, for infinitely many n, we construct opponent schedules for which at least 6n(n−1) breaks are necessary. Finally, we prove that ...
متن کاملRound robin tournaments and three index assignments
Scheduling a sports league can be seen as a difficult combinatorial optimization problem. We study some variants of round robin tournaments and analyze the relationship with the planar three-index assignment problem. The complexity of scheduling a minimum cost round robin tournament is established by a reduction from the planar three-index assignment problem. Furthermore, we introduce integer p...
متن کاملSemidefinite programming based approaches to the break minimization problem
This paper deals with the break minimization problem of sports scheduling. The problem is to find a stadium assignment that minimizes the total number of breaks under a given round-robin tournament schedule. We show that the problem can be formulated as MAX RES CUT and MAX 2SAT. We also apply Goemans and Williamson’s approximation algorithm based on positive semidefinite programming relaxation....
متن کاملThe Home-away Assignment Problems and Break Minimization/maximization Problems in Sports Scheduling
Suppose that we have a timetable of a round-robin tournament with a number of teams, and distances between their homes. The home-away assignment problem is to find a home-away assignment that minimizes the total traveling distance of the teams; the break minimization/maximization problem is to find a home-away assignment that minimizes/maximizes the number of breaks, i.e., the number of occurre...
متن کاملA Problem on Tournaments
By a tournament we mean the outcome of a round-robin tournament in which there are no draws . Such a tournament may be represented by a graph in which the n players are represented by vertices labelled 1, 2, . . . , n, and the outcomes of the games are represented by directed edges so that every pair of vertices is joined by one directed edge . We call such a graph a complete directed graph . O...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2006
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2005.08.009